Learning sparse nonlinear dynamics via mixed-integer optimization

نویسندگان

چکیده

Abstract Discovering governing equations of complex dynamical systems directly from data is a central problem in scientific machine learning. In recent years, the sparse identification nonlinear dynamics (SINDy) framework, powered by heuristic regression methods, has become dominant tool for learning parsimonious models. We propose an exact formulation SINDy using mixed-integer optimization (MIO-SINDy) to solve sparsity constrained provable optimality seconds. On large number canonical ordinary and partial differential equations, we illustrate dramatic improvement our approach accurate model discovery while being more sample efficient, robust noise, flexible accommodating physical constraints.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed-Integer Nonlinear Optimization

Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of ...

متن کامل

Plunge milling time optimization via mixed-integer nonlinear programming

Plunge milling is a recent and efficient production mean for machining deep workpieces, notably in aeronautics. This paper focuses on the minimization of the machining time by optimizing the values of the cutting parameters. Currently, neither Computer-Aided Manufacturing (CAM) software nor standard approaches take into account the tool path geometry and the control laws driving the tool displa...

متن کامل

Minotaur: A Mixed-Integer Nonlinear Optimization Toolkit

We present a flexible framework for general mixed-integer nonlinear programming (MINLP), called Minotaur, that enables both algorithm exploration and structure exploitation without compromising computational efficiency. This paper documents the concepts and classes in our framework and shows that our implementations of standard MINLP techniques are efficient compared with other state-of-the-art...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Problems

Two novel deterministic global optimization algorithms for nonconvex mixed-integer problems (MINLPs) are proposed, using the advances of the BB algorithm for noncon-vex NLPs Adjiman et al. (1998a). The Special Structure Mixed-Integer BB algorithm (SMIN-BB addresses problems with nonconvexities in the continuous variables and linear and mixed-bilinear participation of the binary variables. The G...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Programs

A variety of applications in economics, finance, engineering design, the chemical and biological sciences, and a host of other areas give rise to nonconvex nonlinear and mixed-integer nonlinear programs (NLPs and MINLPs). BARON was originally developed in the early 1990s as a computational system to facilitate experimentation with novel deterministic algorithms for global optimization. Since th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinear Dynamics

سال: 2023

ISSN: ['1573-269X', '0924-090X']

DOI: https://doi.org/10.1007/s11071-022-08178-9